Computing the Projection in an Interior
نویسندگان
چکیده
Global convergence of the long-step aane scaling algorithm for degenerate linear programming problems, 9 tion time can be achieved by using a preconditioned conjugate gradient linear system solver. Convergence of the large step primal aane-scaling algorithm for primal non-degenerate linear programs,
منابع مشابه
Joint Allocation of Computational and Communication Resources to Improve Energy Efficiency in Cellular Networks
Mobile cloud computing (MCC) is a new technology that has been developed to overcome the restrictions of smart mobile devices (e.g. battery, processing power, storage capacity, etc.) to send a part of the program (with complex computing) to the cloud server (CS). In this paper, we study a multi-cell with multi-input and multi-output (MIMO) system in which the cell-interior users request service...
متن کاملFast System Matrix Calculation in CT Iterative Reconstruction
Introduction: Iterative reconstruction techniques provide better image quality and have the potential for reconstructions with lower imaging dose than classical methods in computed tomography (CT). However, the computational speed is major concern for these iterative techniques. The system matrix calculation during the forward- and back projection is one of the most time- cons...
متن کاملA Hybridized Crouziex-Raviart Nonconforming Finite Element and Discontinuous Galerkin Method for a Two-Phase Flow in the Porous Media
In this study, we present a numerical solution for the two-phase incompressible flow in the porous media under isothermal condition using a hybrid of the linear lower-order nonconforming finite element and the interior penalty discontinuous Galerkin (DG) method. This hybridization is developed for the first time in the two-phase modeling and considered as the main novelty of this research.The p...
متن کاملA fast randomized algorithm for orthogonal projection
We describe an algorithm that, given any full-rank matrix A having fewer rows than columns, can rapidly compute the orthogonal projection of any vector onto the null space of A, as well as the orthogonal projection onto the row space of A, provided that both A and its adjoint A can be applied rapidly to arbitrary vectors. As an intermediate step, the algorithm solves the overdetermined linear l...
متن کاملAn improved infeasible interior-point method for symmetric cone linear complementarity problem
We present an improved version of a full Nesterov-Todd step infeasible interior-point method for linear complementarityproblem over symmetric cone (Bull. Iranian Math. Soc., 40(3), 541-564, (2014)). In the earlier version, each iteration consisted of one so-called feasibility step and a few -at most three - centering steps. Here, each iteration consists of only a feasibility step. Thus, the new...
متن کاملComputing the Maximum Volume Inscribed Ellipsoid of a Polytopic Projection
We introduce a novel scheme based on a blending of Fourier-Motzkin elimination (FME) and adjustable robust optimization techniques to compute the maximum volume inscribed ellipsoid (MVE) in a polytopic projection. It is well-known that deriving an explicit description of a projected polytope is NP-hard. Our approach does not require an explicit description of the projection, and can easily be g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993